Controllable Summarization with Constrained Markov Decision Process
نویسندگان
چکیده
Abstract We study controllable text summarization, which allows users to gain control on a particular attribute (e.g., length limit) of the generated summaries. In this work, we propose novel training framework based Constrained Markov Decision Process (CMDP), conveniently includes reward function along with set constraints, facilitate better summarization control. The encourages generation resemble human-written reference, while constraints are used explicitly prevent summaries from violating user-imposed requirements. Our can be applied important attributes including length, covered entities, and abstractiveness, as devise specific for each these aspects. Extensive experiments popular benchmarks show that our CMDP helps generate informative complying given attribute’s requirement.1
منابع مشابه
Constrained Markov Decision Process and Optimal Policies
In the course lectures, we have discussed a lot regarding unconstrained Markov Decision Process (MDP). The dynamic programming decomposition and optimal policies with MDP are also given. However, in this report we are going to discuss a different MDP model, which is constrained MDP. There are many realistic demand of studying constrained MDP. For instance, in the wireless sensors networks, each...
متن کاملAbstractive Meeting Summarization as a Markov Decision Process
ive Meeting Summarization as a Markov Decision Process
متن کاملConstrained Markov Decision Processes
2 i To Tania and Einat ii Preface In many situations in the optimization of dynamic systems, a single utility for the optimizer might not suuce to describe the real objectives involved in the sequential decision making. A natural approach for handling such cases is that of optimization of one objective with constraints on other ones. This allows in particular to understand the tradeoo between t...
متن کاملMarkov Decision Processes with Constrained Stopping Times
The optimization problem for a stopped Markov decision process is considered to be taken over stopping times constrained so that E 5 for some xed > 0. We introduce the concept of a randomized stationary stopping time which is a mixed extension of the entry time of a stopping region and prove the existence of an optimal constrained pair of stationary policy and stopping time by utilizing a Lagra...
متن کاملQuantile Markov Decision Process
In this paper, we consider the problem of optimizing the quantiles of the cumulative rewards of Markov Decision Processes (MDP), to which we refers as Quantile Markov Decision Processes (QMDP). Traditionally, the goal of a Markov Decision Process (MDP) is to maximize expected cumulative reward over a defined horizon (possibly to be infinite). In many applications, however, a decision maker may ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transactions of the Association for Computational Linguistics
سال: 2021
ISSN: ['2307-387X']
DOI: https://doi.org/10.1162/tacl_a_00423